Search results for "Sparse approximation"
showing 10 items of 11 documents
Sparse Manifold Clustering and Embedding to discriminate gene expression profiles of glioblastoma and meningioma tumors.
2013
Sparse Manifold Clustering and Embedding (SMCE) algorithm has been recently proposed for simultaneous clustering and dimensionality reduction of data on nonlinear manifolds using sparse representation techniques. In this work, SMCE algorithm is applied to the differential discrimination of Glioblastoma and Meningioma Tumors by means of their Gene Expression Profiles. Our purpose was to evaluate the robustness of this nonlinear manifold to classify gene expression profiles, characterized by the high-dimensionality of their representations and the low discrimination power of most of the genes. For this objective, we used SMCE to reduce the dimensionality of a preprocessed dataset of 35 single…
Sparse Deconvolution Using Support Vector Machines
2008
Sparse deconvolution is a classical subject in digital signal processing, having many practical applications. Support vector machine (SVM) algorithms show a series of characteristics, such as sparse solutions and implicit regularization, which make them attractive for solving sparse deconvolution problems. Here, a sparse deconvolution algorithm based on the SVM framework for signal processing is presented and analyzed, including comparative evaluations of its performance from the points of view of estimation and detection capabilities, and of robustness with respect to non-Gaussian additive noise. Publicado
Low-Rate Reduced Complexity Image Compression using Directionlets
2006
The standard separable two-dimensional (2-D) wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth images. However, it fails to capture efficiently one-dimensional (1-D) discontinuities, like edges and contours, that are anisotropic and characterized by geometrical regularity along different directions. In our previous work, we proposed a construction of critically sampled perfect reconstruction anisotropic transform with directional vanishing moments (DVM) imposed in the corresponding basis functions, called directionlets. Here, we show that the computational complexity of our transform is comparable to the co…
Group Nonnegative Matrix Factorization with Sparse Regularization in Multi-set Data
2021
Constrained joint analysis of data from multiple sources has received widespread attention for that it allows us to explore potential connections and extract meaningful hidden components. In this paper, we formulate a flexible joint source separation model termed as group nonnegative matrix factorization with sparse regularization (GNMF-SR), which aims to jointly analyze the partially coupled multi-set data. In the GNMF-SR model, common and individual patterns of particular underlying factors can be extracted simultaneously with imposing nonnegative constraint and sparse penalty. Alternating optimization and alternating direction method of multipliers (ADMM) are combined to solve the GNMF-S…
Classification of Melanoma Lesions Using Sparse Coded Features and Random Forests
2016
International audience; Malignant melanoma is the most dangerous type of skin cancer, yet it is the most treatable kind of cancer, conditioned by its early diagnosis which is a challenging task for clinicians and dermatologists. In this regard, CAD systems based on machine learning and image processing techniques are developed to differentiate melanoma lesions from benign and dysplastic nevi using dermoscopic images. Generally, these frameworks are composed of sequential processes: pre-processing, segmentation, and classification. This architecture faces mainly two challenges: (i) each process is complex with the need to tune a set of parameters, and is specific to a given dataset; (ii) the…
Using the dglars Package to Estimate a Sparse Generalized Linear Model
2015
dglars is a publicly available R package that implements the method proposed in Augugliaro et al. (J. R. Statist. Soc. B 75(3), 471-498, 2013) developed to study the sparse structure of a generalized linear model (GLM). This method, called dgLARS, is based on a differential geometrical extension of the least angle regression method. The core of the dglars package consists of two algorithms implemented in Fortran 90 to efficiently compute the solution curve. dglars is a publicly available R package that implements the method proposed in Augugliaro et al. (J. R. Statist. Soc. B 75(3), 471-498, 2013) developed to study the sparse structure of a generalized linear model (GLM). This method, call…
Multilinear sparse decomposition for best spectral bands selection
2014
Optimal spectral bands selection is a primordial step in multispectral images based systems for face recognition. In this context, we select the best spectral bands using a multilinear sparse decomposition based approach. Multispectral images of 35 subjects presenting 25 different lengths from 480nm to 720nm and three lighting conditions: fluorescent, Halogen and Sun light are groupped in a 3-mode face tensor T of size 35x25x2 . T is then decomposed using 3-mode SVD where three mode matrices for subjects, spectral bands and illuminations are sparsely determined. The 25x25 spectral bands mode matrix defines a sparse vector for each spectral band. Spectral bands having the sparse vectors with…
A probabilistic compressive sensing framework with applications to ultrasound signal processing
2019
Abstract The field of Compressive Sensing (CS) has provided algorithms to reconstruct signals from a much lower number of measurements than specified by the Nyquist-Shannon theorem. There are two fundamental concepts underpinning the field of CS. The first is the use of random transformations to project high-dimensional measurements onto a much lower-dimensional domain. The second is the use of sparse regression to reconstruct the original signal. This assumes that a sparse representation exists for this signal in some known domain, manifested by a dictionary. The original formulation for CS specifies the use of an l 1 penalised regression method, the Lasso. Whilst this has worked well in l…
Adaptive sparse representation of continuous input for tsetlin machines based on stochastic searching on the line
2021
This paper introduces a novel approach to representing continuous inputs in Tsetlin Machines (TMs). Instead of using one Tsetlin Automaton (TA) for every unique threshold found when Booleanizing continuous input, we employ two Stochastic Searching on the Line (SSL) automata to learn discriminative lower and upper bounds. The two resulting Boolean features are adapted to the rest of the clause by equipping each clause with its own team of SSLs, which update the bounds during the learning process. Two standard TAs finally decide whether to include the resulting features as part of the clause. In this way, only four automata altogether represent one continuous feature (instead of potentially h…
Fusion of CNN and sparse representation for threat estimation near power lines and poles infrastructure using aerial stereo imagery
2021
Abstract Fires or electrical hazards and accidents can occur if vegetation is not controlled or cleared around overhead power lines, resulting in serious risks to people and property and significant costs to the community. There are numerous blackouts due to interfering the trees with the power transmission lines in hilly and urban areas. Power distribution companies are facing a challenge to monitor the vegetation to avoid blackouts and flash-over threats. Recently, several methods have been developed for vegetation monitoring; however, existing methods are either not accurate or could not provide better disparity map in the textureless region. Moreover, are not able to handle depth discon…